Designing a Smart Traffic Light Algorithm (HMS) Based on Modified Round Robin Algorithm
نویسندگان
چکیده
منابع مشابه
Dynamic Quantum based Genetic Round Robin Algorithm
The performance of CPU is essentially depends on the scheduling algorithms. These algorithms provide a schedule for execution of processes waiting in ready queue. There are various scheduling algorithms; Round Robin is one of them. The performance of Round Robin algorithm is majorly depends on the quantum, generally which is static for all processes. There is not any standard way to decide the ...
متن کاملModified Round Robin Scheduling Algorithm Using Variable Time Slice
CPU scheduling is the basis of multi-programmed operating systems. The main objective of scheduling algorithms is to reduce the response time, waiting time and to increase the throughput and CPU utilization. Round Robin assumes that all processes are equally important; each receives an equal portion (time slice) of the CPU. This will sometimes affect the performance of CPU. This paper considers...
متن کاملPerformance of the Modified Round Robin Scheduling Algorithm for Input-Queued Switches under Self-Similar Traffic
The iSLIP algorithm has been proved to be a very efficient, high throughput scheme for scheduling in input-queued switches. In this paper, we discuss a Modified Round Robin (MRR) scheme, which involves less number of arbitration steps in each iteration when compared to iSLIP. We prove through simulation studies, that the MRR algorithm shows a performance equivalent to iSLIP, but requires less n...
متن کاملAchieving Stability in the Round Robin Algorithm
The Round Robin algorithm is a CPU scheduling algorithm that is designed especially for time sharing systems. Each process is assigned a slice of time called time quantum to execute. To increase the performance of a Round Robin algorithm, it is important to choose an optimal time quantum. Many algorithms developed the Round Robin algorithm. This paper provides an algorithm that improves the per...
متن کاملEvaluation of Surplus Round Robin Scheduling Algorithm
In multi-service packet networks the packet scheduling algorithm plays a key role in delivering guaranteed service to different flows. In this article we evaluate surplus round robin (SRR) scheduling algorithm. We apply the Latency-Rate (LR) servers theory in order to obtain bounds on the latency and delay provided by the algorithm. We compare the performance characteristics of SRR with the pop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kurdistan Journal of Applied Research
سال: 2017
ISSN: 2411-7706,2411-7684
DOI: 10.24017/science.2017.1.8